Computer Science for IGCSE & O level - Algorithm Design And Problem Solving (Section 9 - No. 43)

When implementing a 'Linear Search' algorithm, what aspects characterize the search process?

It compares the target value with each item in the list sequentially.

It is generally the fastest method for searching.

It requires the data to be sorted.

It continues until the target item is found, or until the entire list has been traversed.

Linear search looks at each item one after the other, so it checks each element and stops when a match or the list's end occurs.